func github.com/andybalholm/brotli.findMatchLengthWithLimit
22 uses
github.com/andybalholm/brotli (current package)
backward_references_hq.go#L430: len = findMatchLengthWithLimit(ringbuffer[prev_ix:], ringbuffer[cur_ix_masked:], max_len)
compress_fragment.go#L625: var matched uint = 5 + findMatchLengthWithLimit(in[candidate+5:], in[ip+5:], uint(ip_end-ip)-5)
compress_fragment.go#L683: var matched uint = 5 + findMatchLengthWithLimit(in[candidate+5:], in[ip+5:], uint(ip_end-ip)-5)
compress_fragment_two_pass.go#L334: var matched uint = min_match + findMatchLengthWithLimit(base_ip_ptr[uint(candidate-base_ip)+min_match:], input[uint(ip)+min_match:], uint(ip_end-ip)-min_match)
compress_fragment_two_pass.go#L401: var matched uint = min_match + findMatchLengthWithLimit(base_ip_ptr[uint(candidate-base_ip)+min_match:], input[uint(ip)+min_match:], uint(ip_end-ip)-min_match)
find_match_length.go#L16: func findMatchLengthWithLimit(s1 []byte, s2 []byte, limit uint) uint {
h10.go#L116: len = cur_len + findMatchLengthWithLimit(data[cur_ix_masked+cur_len:], data[prev_ix_masked+cur_len:], max_length-cur_len)
h10.go#L190: var len uint = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
h5.go#L146: var len uint = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
h5.go#L190: var len uint = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
h6.go#L148: var len uint = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
h6.go#L192: var len uint = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
hash.go#L135: matchlen = findMatchLengthWithLimit(data, dictionary.words.data[offset:], uint(len))
hash_forgetful_chain.go#L186: var len uint = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
hash_forgetful_chain.go#L229: var len uint = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
hash_longest_match_quickly.go#L130: var len uint = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
hash_longest_match_quickly.go#L167: len = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
hash_longest_match_quickly.go#L194: len = findMatchLengthWithLimit(data[prev_ix:], data[cur_ix_masked:], max_length)
hash_rolling.go#L152: var len uint = findMatchLengthWithLimit(data[found_ix_masked:], data[cur_ix_masked:], max_length)
static_dict.go#L37: return findMatchLengthWithLimit(dict.data[offset:], data, brotli_min_size_t(uint(len), maxlen))
static_dict.go#L48: return findMatchLengthWithLimit(dict, data, uint(w.len)) == uint(w.len)
static_dict.go#L52: return dict[0] >= 'a' && dict[0] <= 'z' && (dict[0]^32) == data[0] && findMatchLengthWithLimit(dict[1:], data[1:], uint(w.len)-1) == uint(w.len-1)
 |
The pages are generated with Golds v0.8.4. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds. |